On Combining Partial Order Reduction with Fairness Assumptions

نویسندگان

  • Lubos Brim
  • Ivana Cerná
  • Pavel Moravec
  • Jirí Simsa
چکیده

We present a new approach to combine partial order reduction with fairness in the context of LTL model checking. For this purpose, we define several behaviour classes representing typical fairness assumptions and examine how various reduction techniques affect these classes. In particular, we consider both reductions preserving all behaviours and reductions preserving only some behaviours.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Combining State Space Reductions with Global Fairness Assumptions

Model checking has established itself as an effective system analysis method, as it is capable of proving/dis-proving properties automatically. Its application to practical systems is however limited by state space explosion. Among effective state reduction techniques are symmetry reduction and partial order reduction. Global fairness often plays a vital role in designing self-stabilizing popul...

متن کامل

Specifying and Verifying Event-Based Fairness Enhanced Systems

Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric. In this paper, we describe a framework for systematically specifying and verifying event-based systems under fairness assumptions. We introduce different event annotations to associate fairness constraints with individual events. Fairne...

متن کامل

Model Checking LTL with Fairness Assumptions using Net Unfoldings

We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in [1]...

متن کامل

Partial Order Reduction in Presence of Rendez-vous Communications with Priority Choice and Weak Fairness

If synchronizing (rendez-vous) communications are used in Promela models, the priority choice feature (unless construct) and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin’s verifier. After identifying the wrong partial order reduction pattern that causes both incompatibilities, we give solutions to these two problems. To this end we propo...

متن کامل

Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness

If synchronizing (rendez-vous) communications are used in the Promela models, the unless construct and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin's veri er. After identifying the wrong partial order reduction pattern that causes the incompatibility, we give solutions for these two problems. To this end we propose corrections in the ide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006